Boolean functions minimization by the method of figurative transformations
نویسندگان
چکیده
منابع مشابه
Minimization of Boolean Functions
This thesis presents two new methods of test-per-clock BIST design for combinational circuits. One of them is based on a transformation of the PRPG code words into test patterns generated by an ATPG tool. This transformation is done by a combinational circuit. For a design of such a circuit two major tasks have to be solved: first, the proper matching between the PRPG code words and the test pa...
متن کاملEfficient Minimization Method for Incompletely Defined Boolean Functions
The paper presents a minimization algorithm for Boolean functions whose values are defined only for a small part of their range. In contrast to other known minimization algorithms, it uses the "start big" strategy gradually reducing the dimensionality of a term until an implicant is generated. This approach leads to a very fast solution even for problems with several hundreds of input variables...
متن کاملAlgorithm for Minimization of Partial Boolean Functions
The paper presents a minimization algorithm for Boolean functions defined by truth tables. It treats only minterms having defined output values and is thus efficient above all in case of highly undefined functions, where the methods processing also the don't care states lose much time. The algorithm proves its full strength for functions with several hundreds of variables and several hundreds o...
متن کاملThe Minimization Method of Boolean Functions in Polynomial Set-theoretical Format
Abstract. A generalized of conjuncterms simplification rules in polynomial settheoretical format has been considered. These rules are based on the proposed theorems for different initial conditions transform of pair conjuncterms, Hamming distance between them can be arbitrary. These rules may be useful to minimize in polynomial set-theoretical format of arbitrary logic functions with n variable...
متن کاملBdd Minimization by Linear Transformations
Binary Decision Diagrams (BDDs) are a powerful tool and are frequently used in many applications in VLSI CAD, like synthesis and veriication. Unfortunately, BDDs are very sensitive to the variable ordering and their size often becomes infeasible. Recently, a new approach for BDD minimization based on linear transformations, i.e. a special type of spectral techniques, has been proposed. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Technology transfer: fundamental principles and innovative technical solutions
سال: 2018
ISSN: 2585-6839,2585-6847
DOI: 10.21303/2585-6847.2018.00755